Rivisiting Token/Bucket Algorithms in New Applications

نویسنده

  • Andrea Pasquinucci
چکیده

We consider a somehow peculiar Token/Bucket problem which at first sight looks confusing and difficult to solve. The winning approach to solve the problem consists in going back to the simple and traditional methods to solve computer science problems like the one taught to us by Knuth. Somehow the main trick is to be able to specify clearly what needs to be achieved, and then the solution, even if complex, appears almost by

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Logic based Approach for VoIP Quality Maintaining

Voice communication is an emerging technology and has great importance in our routine life. Perceptual, Voice over Internet Protocol quality is an important issue for VoIP Apps services because VoIP Apps require real-time support. Many network factors (packet loss, packet delay, and jitter) affect to VoIP quality, to achieve this objective we used an approach based on Fuzzy Logic. We configure ...

متن کامل

Network Traffic Characterization Using Token Bucket Model

This paper investigated the problem of deriving token bucket parameters from the observed traffic patterns of computer network flows in two cases. In the basic case, we identified the set of token bucket parameters for any given flow so that all the packets in the flow will be delivered immediately without incurring any delay or loss. Then, we extended the basic case by adding a queue to the to...

متن کامل

The Token Bucket Allocation and Reallocation Problems ( MPRASE Token Bucket )

This paper deals with the dimensioning of token buckets. Two related problems are formulated and solved. The first is the token bucket allocation problem (TBAP) which is finding the cost-minimal token bucket for the transmission of a given VBR traffic stream, e.g. an MPEG movie, from the user's point of view. This problem has been treated in literature before but as we will show not completely....

متن کامل

Efficient On-Line Traffic Policing for Confidence Level based Traffic Model

On-line traffic, such as conversational call, live video, serves a large group of applications in the internet now days. An important feature of on-line traffic is that they are not pre-recorded and no exact information about each session’s traffic is known before the traffic happens. S-BIND (Confidence-levelbased Statistical Bounding Interval-length Dependent) traffic model was proposed to cha...

متن کامل

Randomized Token Buckets : Reducing the Bu ers Required in

We study the buuer requirements for N identical token bucket streams that are fed to a multiplexor. If the token bucket streams are synchronized the buuer size requirement at the multiplexor is N B, where B is the size of the token bucket. We introduce a new variant of token bucket schemes that we call randomized token bucket schemes that insert random delays to prevent the streams from becomin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0906.0328  شماره 

صفحات  -

تاریخ انتشار 2009